The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio

Source URL: research.yahoo.com

• NP-complete problems
• Graph operations
• Graph coloring
• Dense subgraph
• Graph partition
• Community structure
• Tree
• Shortest path problem
• Graph
• Graph theory
• Theoretical computer science
• Mathematics

Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma∗ , Jiang Chen∗ , Yang Richard Yang∗ and Arvind Krishnamurthy† ∗ Department of Computer Science

Source URL: www-net.cs.yale.edu

• Graph theory
• Network flow
• Distributed computing architecture
• Network architecture
• Overlay network
• Peer-to-peer
• Maximum flow problem
• Network congestion
• Shortest path problem
• Mathematics
• Operations research
• Applied mathematics

Journal of Environmental Management, 265–278 doi:jema, available online at http://www.idealibrary.com on Landscape connectivity: A conservation application of graph theory A. G. Bunn†§* ,

Source URL: www.physics.mun.ca

• Minimum spanning tree
• Spanning tree
• Topology
• Graph
• Line graph
• Shortest path problem
• Connectivity
• Path
• Tree
• Graph theory
• Mathematics
• Graph connectivity

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

Source URL: dsw.users.sonic.net

• Routing algorithms
• Network flow
• Network theory
• Shortest path problem
• Routing
• Maximum flow problem
• Floyd–Warshall algorithm
• Graph
• Network topology
• Graph theory
• Mathematics
• Theoretical computer science

Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar

Source URL: www.statistics.du.se

• NP-complete problems
• Travelling salesman problem
• Induced path
• Shortest path problem
• Graph
• Routing
• Combinatorial optimization
• Path
• Hamiltonian path
• Graph theory
• Theoretical computer science
• Mathematics

Map-Matching for Low-Sampling-Rate GPS Trajectories Yin Lou Chengyang Zhang Yu Zheng

Source URL: www.cse.unt.edu

• Graph theory
• Routing algorithms
• Search algorithms
• Game artificial intelligence
• Command and control
• Global Positioning System
• A* search algorithm
• Traffic flow
• Shortest path problem
• Mathematics
• Combinatorial optimization
• Technology

Label-correcting algorithms for solving large hop-constrained shortest path problems Oleg Burdakov Linkoping University, Sweden Abstract. We shall consider the problem of finding a shortest path in

Source URL: www.hse.ru

COMPSCI 530: Design and Analysis of AlgorithmsLecture 22 Lecturer: Debmalya Panigrahi

Source URL: www.cs.duke.edu

• Operations research
• Convex optimization
• Linear programming
• Degree
• Shortest path problem
• Graph
• Matching
• Mathematics
• Graph theory
• Theoretical computer science

6.889 — Lecture 4: Single-Source Shortest Paths Christian Sommer September 19 and 26, 2011 Single-Source Shortest Path (SSSP) Problem: given a graph G = (V, E) and a source vertex s ∈ V , compute shortes

Source URL: courses.csail.mit.edu

• Network theory
• Shortest path problem
• Fibonacci heap
• Binary logarithm
• Mathematics
• Graph theory
• Theoretical computer science

Walk the Line: Consistent Network Updates with Bandwidth Guarantees Soudeh Ghorbani and Matthew Caesar Department of Computer Science University of Illinois at Urbana-Champaign 201 North Goodwin Avenue

Source URL: conferences.sigcomm.org

• Routing algorithms
• Search algorithms
• Combinatorial optimization
• Game artificial intelligence
• Network theory
• Heuristic function
• Routing
• A* search algorithm
• Shortest path problem
• Mathematics
• Graph theory
• Theoretical computer science